نتایج جستجو برای: strongly 2-multiplicative
تعداد نتایج: 2694840 فیلتر نتایج به سال:
In this paper we obtain an upper bound and also a lower bound for maximum edges of strongly 2 multiplicative graphs of order n. Also we prove that triangular ladder the graph obtained by duplication of an arbitrary edge by a new vertex in path and the graphobtained by duplicating all vertices by new edges in a path and some other graphs are strongly 2 multiplicative
0
Abstract: A graph G with p vertices is said to be strongly multiplicative if the vertices of G can be labeled with p consecutive positive integers 1, 2, ..., p such that label induced on the edges by the product of labels of end vertices are all distinct. In this paper we investigate strongly multiplicative labeling of some snake related graphs. We prove that alternate triangular snake and alte...
Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether or not there exist efficient constructions of strongly multiplicative LSSS from general LSSS. In this paper, we propose the new concept of a 3-multiplicative LSSS, and establish its relationship with strongly multiplic...
Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether or not there exist efficient constructions of strongly multiplicative LSSS from general LSSS. In this paper, we propose the new concept of 3-multiplicative LSSS, and establish its relationship with strongly multiplicat...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید